On k-path pancyclic graphs
نویسندگان
چکیده
For integers k and n with 2 ≤ k ≤ n− 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum degree of G, (b) the minimum degree-sum of nonadjacent vertices of G and (c) the size of G such that G is k-path pancyclic
منابع مشابه
Geodesic-pancyclic graphs
A shortest path connecting two vertices u and v is called a u-v geodesic. The distance between u and v, denoted by dG(u, v), is the number of edges in a u-v geodesic. A graph G with n vertices is geodesic-pancyclic if for each pair of vertices u, v ∈ V (G), every u-v geodesic lies on every cycle of length k satisfying max{2dG(u, v), 3} ≤ k ≤ n. In this paper, we study the properties for graphs ...
متن کاملs-Vertex Pancyclic Index
A graph G is vertex pancyclic if for each vertex v ∈ V (G), and for each integer k with 3 ≤ k ≤ |V (G)|, G has a k-cycle Ck such that v ∈ V (Ck). Let s ≥ 0 be an integer. If the removal of at most s vertices in G results in a vertex pancyclic graph, we say G is an s-vertex pancyclic graph. Let G be a simple connected graph that is not a path, cycle or K1,3. Let l(G) = max{m : G has a divalent p...
متن کاملWeakly pancyclic graphs
In generalizing the concept of a pancyclic graph, we say that a graph is ‘weakly pancyclic’ if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic are considerably weaker than those required to ensure that it is pancyclic. This sheds some light o...
متن کاملMinimum Degree Conditions for Cycles Including Specified Sets of Vertices
This paper generalises the concept of vertex pancyclic graphs. We define a graph as set-pancyclic if for every set S of vertices there is a cycle of every possible length containing S. We show that if the minimum degree of a graph exceeds half its order then the graph is set-pancyclic. We define a graph as k-ordered-pancyclic if, for every set S of cardinality k and every cyclic ordering of S, ...
متن کاملPancyclic graphs and linear forests
Given integers k, s, t with 0 ≤ s ≤ t and k ≥ 0, a (k, t, s)-linear forest F is a graph that is the vertex disjoint union of t paths with a total of k edges and with s of the paths being single vertices. If the number of single vertex paths is not critical, the forest F will simply be called a (k, t)-linear forest. A graph G of order n ≥ k + t is (k, t)-hamiltonian if for any (k, t)-linear fore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 2015